from collections import defaultdict, deque
from functools import lru_cache
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from fractions import Fraction as frac
import math
hpop = heappop
hpush = heappush
MOD = 10**9 + 7
def calc(x):
d_sum = sum(map(int,str(x)))
return x*x + d_sum *x
def solution():
n,d = map(int, input().split())
n += 1
k = 1
while 1:
if n%k > d:
break
k *= 10
k //= 10
print(n - n%k - 1)
def main():
t = 1
for _ in range(t):
solution()
import sys
import threading
sys.setrecursionlimit(1 << 30)
threading.stack_size(1 << 27)
thread = threading.Thread(target=main)
thread.start(); thread.join()
#include<iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define HarveySpecter ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using ll= long long;
const int N=1e5+7;
int main()
{
HarveySpecter;
ll p,d;
cin>>p>>d;
ll diff = 0;
ll no;
ll k = 1;
ll x;
ll ans = p;
while(1)
{
no = p;
x = pow(10,k);
no = p - p%x - 1;
diff = p - no;
k++;
if(diff <= d)
{
if(no % x > p % x)
{
ans = no;
}
}
else
{
break;
}
}
cout<<ans;
return 0;
}647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |